Isolated trees in a bichromatic random graph
نویسندگان
چکیده
منابع مشابه
A Pointwise Approximation of Isolated Trees in a Random Graph
In this paper, we give a pointwise approximation of the number of isolated trees of order k in a random graph by Poisson distribution. The technique we used here is the Stein’s method.
متن کاملPlanar bichromatic minimum spanning trees
Given a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. Computing this tree is NP-hard in general. We present an O(n) time algorithm for the special case when all points are in convex position. For the general case, we present a f...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملDiameter of random spanning trees in a given graph
We show that a random spanning tree formed in a general graph G (such as a power law graph) has diameter much larger than the diameter of G. We show, with high probability the diameter of a random spanning tree of G is shown to be between c √ n and c′ √ n log n, where c and c′ depend on the spectral gap of G and the ratio of the moments of the degree sequence. For the special case of regular gr...
متن کاملOnline Graph Prediction with Random Trees
In online transductive graph prediction a learner is initially given an undirected graph G = (V,E) with unknown binary labels y = (y1, . . . , yn) ∈ {−1,+1}n assigned to the vertices V = {1, . . . , n}. At time t = 1 an arbitrary vertex i1 ∈ V is selected and the learner must predict its label yi1 ∈ {−1,+1}. Then yi1 is revealed and a new vertex i2 6= i1 of V is selected. This process goes on f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1982
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-47-1-153-162